Constraint Modelling Challenge 2005

نویسندگان

  • Barbara M. Smith
  • Ian P. Gent
چکیده

We consider a manufacturing scheduling problem in which the sequence of products to be manufactured has to be determined so as to minimize the number of customer orders that have been started and are waiting to be completed. We describe a straightforward local search method together with a powerful lower bound based on a MIP formulation. Finally we introduce another MIP with specific cuts that allows us to optimally solve medium size instances. Experimental results are reported.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Rules of Constraint Modelling: An Overview

We address a major bottleneck in the use of constraint programming: modelling. Our system CONJURE automatically refines a specification of a problem in our abstract constraint specification language, ESSENCE, into a set of alternative constraint programs, thus automating an important part of the modelling process and helping to reduce the modelling bottleneck significantly.

متن کامل

Towards the new modelling language Zinc

Combinatorial optimization problems are usually tackled in two steps: modelling and solving. Three main approaches are used for solving: Mathematical Methods (MM), Constraint Programming (CP) and Local Search (LS). For modelling the main tools are constraint programming languages, constraint programming libraries and (mathematical) modelling languages. Modelling languages provide the best appro...

متن کامل

Ph . D . Activity

This report describes the research activity carried out by the author during the academic year 2005/2006, mainly focused on two topics of Constraint Programming (CP): Problem Reformulation and Decomposition. 1 Research Context: Constraint Programming and Modelling In this section, an overview of Constraint Programming & Modelling is given, along with a description of its most tipical issues. 1....

متن کامل

Modelling and Solving Problems with Constraints

The CHOCO (CHic, un Outil Contraintes avec des Objets – great, a constraint programming tool with objects) constraint programming system is an emanation of the French OCRE (Outil Contraintes pour la Recherche et l’Enseignement – a constraint tool for research and teaching) group. Choco is a java library for constraint satisfaction problems, constraint programming, and explanation-based constrai...

متن کامل

Representations of Sets and Multisets in Constraint Programming

Constraint programming is a powerful and general purpose tool, but its use is limited, as the process of refining a specification of a problem into an efficient constraint program (known as modelling) is more of an art than a science at present and must be learned by years of experience. This paper theoretically analyses one frequently occurring pattern in modelling, how to choose between diffe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005